Canonical calculi with (n,k)-ary quantifiers
نویسندگان
چکیده
منابع مشابه
Canonical Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no other connective is mentioned. [2] provides a constructive coherence criterion for the non-triviality of such systems and shows that a system of this kind admits cut...
متن کاملCanonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no other connective is mentioned. [1] provides a constructive coherence criterion for the non-triviality of such systems and shows that a system of this kind admits cut...
متن کاملCanonical (m,n)−ary hypermodules over Krasner (m,n)−ary hyperrings
The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...
متن کاملUnification nets: canonical proof net quantifiers
Proof nets for MLL (unit-free Multiplicative Linear Logic) are concise graphical representations of proofs which are canonical in the sense that they abstract away syntactic redundancy such as the order of non-interacting rules. We argue that Girard's extension to MLL1 (first-order MLL) fails to be canonical because of redundant existential witnesses, and present canonical MLL1 proof nets calle...
متن کاملQuantifiers and n-ary binders: an OpenMath standard enhancement proposal
It is proposed that the restriction in the OpenMath standard that an OMBIND element must have exactly three children should be lifted, to support more general binder symbols. The case of logics with generalised quantifiers is described in some detail, since these turn out to not have a natural encoding within OpenMath 2.0, because of precisely this restriction. That restricting quantifiers to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2008
ISSN: 1860-5974
DOI: 10.2168/lmcs-4(3:2)2008